<!DOCTYPE html>
<html lang="en">

<head>
    <meta charset="UTF-8">
    <meta name="viewport" content="width=device-width, initial-scale=1.0">
    <title>Document</title>
</head>

<body>
    <script src="crypto-js.js"></script>
    <script>


        var i6c = { csrf_token: '4a193306c2eec51093bf7a83524930b8' }
        window.NEJ = window.NEJ || {};
        NEJ.O = {};
        NEJ.R = [];
        NEJ.F = function () {
            return !1
        }
            ;

        NEJ.P = function (Jb5g) {
            if (!Jb5g || !Jb5g.length)
                return null;
            let bhx0x = window;
            let a = Jb5g.split("."), l = a.length, i = a[0] === "window" ? 1 : 0;
            for (; i < l; bhx0x = bhx0x[a[i]] = bhx0x[a[i]] || {},
                i++)
                ;
            return bhx0x
        }
        var bc6W = NEJ.O
        var GY5d = function (i6c, u6o) {
            try {
                u6o = u6o.toLowerCase();
                if (i6c === null)
                    return u6o == "null";
                if (i6c === undefined)
                    return u6o == "undefined";
                return bc6W.toString.call(i6c).toLowerCase() == "[object " + u6o + "]"
            } catch (e) {
                return !1
            }
        };
        (function () {
            var c6e = NEJ.P
                , eu7n = c6e("nej.g")
                , t6n = c6e("nej.j")
                , j6d = c6e("nej.u")
                , RR7K = c6e("nm.x.ek");
            RR7K.emj = {
                "色": "00e0b",
                "流感": "509f6",
                "这边": "259df",
                "弱": "8642d",
                "嘴唇": "bc356",
                "亲": "62901",
                "开心": "477df",
                "呲牙": "22677",
                "憨笑": "ec152",
                "猫": "b5ff6",
                "皱眉": "8ace6",
                "幽灵": "15bb7",
                "蛋糕": "b7251",
                "发怒": "52b3a",
                "大哭": "b17a8",
                "兔子": "76aea",
                "星星": "8a5aa",
                "钟情": "76d2e",
                "牵手": "41762",
                "公鸡": "9ec4e",
                "爱意": "e341f",
                "禁止": "56135",
                "狗": "fccf6",
                "亲亲": "95280",
                "叉": "104e0",
                "礼物": "312ec",
                "晕": "bda92",
                "呆": "557c9",
                "生病": "38701",
                "钻石": "14af6",
                "拜": "c9d05",
                "怒": "c4f7f",
                "示爱": "0c368",
                "汗": "5b7a4",
                "小鸡": "6bee2",
                "痛苦": "55932",
                "撇嘴": "575cc",
                "惶恐": "e10b4",
                "口罩": "24d81",
                "吐舌": "3cfe4",
                "心碎": "875d3",
                "生气": "e8204",
                "可爱": "7b97d",
                "鬼脸": "def52",
                "跳舞": "741d5",
                "男孩": "46b8e",
                "奸笑": "289dc",
                "猪": "6935b",
                "圈": "3ece0",
                "便便": "462db",
                "外星": "0a22b",
                "圣诞": "8e7",
                "流泪": "01000",
                "强": "1",
                "爱心": "0CoJU",
                "女孩": "m6Qyw",
                "惊恐": "8W8ju",
                "大笑": "d"
            };
            RR7K.md = ["色", "流感", "这边", "弱", "嘴唇", "亲", "开心", "呲牙", "憨笑", "猫", "皱眉", "幽灵", "蛋糕", "发怒", "大哭", "兔子", "星星", "钟情", "牵手", "公鸡", "爱意", "禁止", "狗", "亲亲", "叉", "礼物", "晕", "呆", "生病", "钻石", "拜", "怒", "示爱", "汗", "小鸡", "痛苦", "撇嘴", "惶恐", "口罩", "吐舌", "心碎", "生气", "可爱", "鬼脸", "跳舞", "男孩", "奸笑", "猪", "圈", "便便", "外星", "圣诞"]
        }
        )();
        var c6e = NEJ.P
            , eu7n = c6e("nej.g")
            , t6n = c6e("nej.j")
            , j6d = c6e("nej.u")
            , RR7K = c6e("nm.x.ek")
            , l6f = c6e("nm.x"), j6d = c6e("nej.u");

        j6d.gS8K = function (i6c) {
            return GY5d(i6c, "function")
        }

        j6d.bh6b = function (k6e, cG7z, O6I) {
            if (!k6e || !k6e.length || !j6d.gS8K(cG7z))
                return this;
            if (!!k6e.forEach) {
                k6e.forEach(cG7z, O6I);
                return this
            }
            for (var i = 0, l = k6e.length; i < l; i++)
                cG7z.call(O6I, k6e[i], i, k6e);
            return this
        }
        var bse8W = function (cya4e) {
            var m6g = [];
            j6d.bh6b(cya4e, function (cxZ4d) {
                m6g.push(RR7K.emj[cxZ4d])
            });
            return m6g.join("")
        };

        // const bVj1x = window.asrsea(JSON.stringify(i6c), bse8W(["流泪", "强"]), bse8W(RR7K.md), bse8W(["爱心", "女孩", "惊恐", "大笑"]));

        console.log(JSON.stringify(i6c));
        console.log(bse8W(["流泪", "强"]));
        console.log(bse8W(RR7K.md));
        console.log(bse8W(["爱心", "女孩", "惊恐", "大笑"]));
        function say_hello(name) {
            return "hello" + name;
        }
        function RSAKeyPair(a, b, c) {
            this.e = biFromHex(a),
                this.d = biFromHex(b),
                this.m = biFromHex(c),
                this.chunkSize = 2 * biHighIndex(this.m),
                this.radix = 16,
                this.barrett = new BarrettMu(this.m)
        }
        function setMaxDigits(a) {
            maxDigits = a,
                ZERO_ARRAY = new Array(maxDigits);
            for (var b = 0; b < ZERO_ARRAY.length; b++)
                ZERO_ARRAY[b] = 0;
            bigZero = new BigInt,
                bigOne = new BigInt,
                bigOne.digits[0] = 1
        }
        function BigInt(a) {
            this.digits = "boolean" == typeof a && 1 == a ? null : ZERO_ARRAY.slice(0),
                this.isNeg = !1
        }
        function biFromHex(a) {
            var d, e, b = new BigInt, c = a.length;
            for (d = c,
                e = 0; d > 0; d -= 4,
                ++e)
                b.digits[e] = hexToDigit(a.substr(Math.max(d - 4, 0), Math.min(d, 4)));
            return b
        }
        function hexToDigit(a) {
            var d, b = 0, c = Math.min(a.length, 4);
            for (d = 0; c > d; ++d)
                b <<= 4,
                    b |= charToHex(a.charCodeAt(d));
            return b
        }
        function charToHex(a) {
            var h, b = 48, c = b + 9, d = 97, e = d + 25, f = 65, g = 90;
            return h = a >= b && c >= a ? a - b : a >= f && g >= a ? 10 + a - f : a >= d && e >= a ? 10 + a - d : 0
        }
        function biHighIndex(a) {
            for (var b = a.digits.length - 1; b > 0 && 0 == a.digits[b];)
                --b;
            return b
        }
        function BarrettMu(a) {
            this.modulus = biCopy(a),
                this.k = biHighIndex(this.modulus) + 1;
            var b = new BigInt;
            b.digits[2 * this.k] = 1,
                this.mu = biDivide(b, this.modulus),
                this.bkplus1 = new BigInt,
                this.bkplus1.digits[this.k + 1] = 1,
                this.modulo = BarrettMu_modulo,
                this.multiplyMod = BarrettMu_multiplyMod,
                this.powMod = BarrettMu_powMod
        }
        function BarrettMu_modulo(a) {
            var i, b = biDivideByRadixPower(a, this.k - 1), c = biMultiply(b, this.mu), d = biDivideByRadixPower(c, this.k + 1), e = biModuloByRadixPower(a, this.k + 1), f = biMultiply(d, this.modulus), g = biModuloByRadixPower(f, this.k + 1), h = biSubtract(e, g);
            for (h.isNeg && (h = biAdd(h, this.bkplus1)),
                i = biCompare(h, this.modulus) >= 0; i;)
                h = biSubtract(h, this.modulus),
                    i = biCompare(h, this.modulus) >= 0;
            return h
        }
        function BarrettMu_multiplyMod(a, b) {
            var c = biMultiply(a, b);
            return this.modulo(c)
        }
        function BarrettMu_powMod(a, b) {
            var d, e, c = new BigInt;
            for (c.digits[0] = 1,
                d = a,
                e = b; ;) {
                if (0 != (1 & e.digits[0]) && (c = this.multiplyMod(c, d)),
                    e = biShiftRight(e, 1),
                    0 == e.digits[0] && 0 == biHighIndex(e))
                    break;
                d = this.multiplyMod(d, d)
            }
            return c
        }
        function biCopy(a) {
            var b = new BigInt(!0);
            return b.digits = a.digits.slice(0),
                b.isNeg = a.isNeg,
                b
        }
        function biDivideModulo(a, b) {
            var f, g, h, i, j, k, l, m, n, o, p, q, r, s, c = biNumBits(a), d = biNumBits(b), e = b.isNeg;
            if (d > c)
                return a.isNeg ? (f = biCopy(bigOne),
                    f.isNeg = !b.isNeg,
                    a.isNeg = !1,
                    b.isNeg = !1,
                    g = biSubtract(b, a),
                    a.isNeg = !0,
                    b.isNeg = e) : (f = new BigInt,
                        g = biCopy(a)),
                    new Array(f, g);
            for (f = new BigInt,
                g = a,
                h = Math.ceil(d / bitsPerDigit) - 1,
                i = 0; b.digits[h] < biHalfRadix;)
                b = biShiftLeft(b, 1),
                    ++i,
                    ++d,
                    h = Math.ceil(d / bitsPerDigit) - 1;
            for (g = biShiftLeft(g, i),
                c += i,
                j = Math.ceil(c / bitsPerDigit) - 1,
                k = biMultiplyByRadixPower(b, j - h); -1 != biCompare(g, k);)
                ++f.digits[j - h],
                    g = biSubtract(g, k);
            for (l = j; l > h; --l) {
                for (m = l >= g.digits.length ? 0 : g.digits[l],
                    n = l - 1 >= g.digits.length ? 0 : g.digits[l - 1],
                    o = l - 2 >= g.digits.length ? 0 : g.digits[l - 2],
                    p = h >= b.digits.length ? 0 : b.digits[h],
                    q = h - 1 >= b.digits.length ? 0 : b.digits[h - 1],
                    f.digits[l - h - 1] = m == p ? maxDigitVal : Math.floor((m * biRadix + n) / p),
                    r = f.digits[l - h - 1] * (p * biRadix + q),
                    s = m * biRadixSquared + (n * biRadix + o); r > s;)
                    --f.digits[l - h - 1],
                        r = f.digits[l - h - 1] * (p * biRadix | q),
                        s = m * biRadix * biRadix + (n * biRadix + o);
                k = biMultiplyByRadixPower(b, l - h - 1),
                    g = biSubtract(g, biMultiplyDigit(k, f.digits[l - h - 1])),
                    g.isNeg && (g = biAdd(g, k),
                        --f.digits[l - h - 1])
            }
            return g = biShiftRight(g, i),
                f.isNeg = a.isNeg != e,
                a.isNeg && (f = e ? biAdd(f, bigOne) : biSubtract(f, bigOne),
                    b = biShiftRight(b, i),
                    g = biSubtract(b, g)),
                0 == g.digits[0] && 0 == biHighIndex(g) && (g.isNeg = !1),
                new Array(f, g)
        }
        function biDivide(a, b) {
            return biDivideModulo(a, b)[0]
        }
        function biNumBits(a) {
            var e, b = biHighIndex(a), c = a.digits[b], d = (b + 1) * bitsPerDigit;
            for (e = d; e > d - bitsPerDigit && 0 == (32768 & c); --e)
                c <<= 1;
            return e
        }
        var maxDigits, ZERO_ARRAY, bigZero, bigOne, dpl10, lr10, hexatrigesimalToChar, hexToChar, highBitMasks, lowBitMasks, biRadixBase = 2, biRadixBits = 16, bitsPerDigit = biRadixBits, biRadix = 65536, biHalfRadix = biRadix >>> 1, biRadixSquared = biRadix * biRadix, maxDigitVal = biRadix - 1, maxInteger = 9999999999999998;
        function arrayCopy(a, b, c, d, e) {
            var g, h, f = Math.min(b + e, a.length);
            for (g = b,
                h = d; f > g; ++g,
                ++h)
                c[h] = a[g]
        }
        function biShiftLeft(a, b) {
            var e, f, g, h, c = Math.floor(b / bitsPerDigit), d = new BigInt;
            for (arrayCopy(a.digits, 0, d.digits, c, d.digits.length - c),
                e = b % bitsPerDigit,
                f = bitsPerDigit - e,
                g = d.digits.length - 1,
                h = g - 1; g > 0; --g,
                --h)
                d.digits[g] = d.digits[g] << e & maxDigitVal | (d.digits[h] & highBitMasks[e]) >>> f;
            return d.digits[0] = d.digits[g] << e & maxDigitVal,
                d.isNeg = a.isNeg,
                d
        }

        !function () {
            function a(a) {
                var d, e, b = "abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ0123456789", c = "";
                for (d = 0; a > d; d += 1)
                    e = Math.random() * b.length,
                        e = Math.floor(e),
                        c += b.charAt(e);
                return c
            }
            function c(a, b, c) {
                var d, e;
                return setMaxDigits(131),
                    d = new RSAKeyPair(b, "", c),
                    e = encryptedString(d, a)
            }
            function b(a, b) {
                var c = CryptoJS.enc.Utf8.parse(b)
                    , d = CryptoJS.enc.Utf8.parse("0102030405060708")
                    , e = CryptoJS.enc.Utf8.parse(a)
                    , f = CryptoJS.AES.encrypt(e, c, {
                        iv: d,
                        mode: CryptoJS.mode.CBC
                    });
                return f.toString()
            }
            function d(d, e, f, g) {
                var h = {}
                    , i = a(16);
                return h.encText = b(d, g),
                    h.encText = b(h.encText, i),
                    h.encSecKey = c(i, e, f),
                    h
            }
            function e(a, b, d, e) {
                var f = {};
                return f.encText = c(a + e, b, d),
                    f
            }
            window.asrsea = d,
                window.ecnonasr = e
        }();
        const bVj1x = window.asrsea(JSON.stringify(i6c), bse8W(["流泪", "强"]), bse8W(RR7K.md), bse8W(["爱心", "女孩", "惊恐", "大笑"]));
        console.log(bVj1x);

    </script>
</body>

</html>